The Strong Chromatic Index of Random Graphs

The strong chromatic index of a graph G, denoted by χs(G), is the minimum number of colors needed to color its edges so that each color class is an induced matching. In this paper we analyze the asymptotic behavior of this parameter in a random graph G(n, p), for two regions of the edge probability p = p(n). For the dense case, where p is a constant, 0 < p < 1, we prove that with high probability χs(G) ≤ (1 + o(1)) 34 np logb n , where b = 1/(1 − p). This improves upon a result of Czygrinow and Nagle [Discrete Math., 281 (2004), pp. 129–136]. For the sparse case, where np < 1 100 √ logn/ log logn, we show that with high probability χs(G) = Δ1(G), where Δ1(G) = max{d(u) + d(v) − 1 : (u, v) ∈ E(G)}. This improves a result of Palka [Australas. J. Combin., 18 (1998), pp. 219–226].